LU Factorization of Non-standard Forms and Direct Multiresolution Solvers
نویسندگان
چکیده
In this paper we introduce the multiresolution LU factorization of non-standard forms (NS-forms) and develop fast direct multiresolution methods for solving systems of linear algebraic equations arising in elliptic problems. The NS-form has been shown to provide a sparse representation for a wide class of operators, including those arising in strictly elliptic problems. For example, Green’s functions of such operators (which are ordinarily represented by dense matrices, e.g., of size N by N) may be represented by 0log erN coefficients, where e is the desired accuracy. The NS-form is not an ordinary matrix representation and the usual operations such as multiplication of a vector by the NS-form are different from the standard matrix–vector multiplication. We show that (up to a fixed but arbitrary accuracy) the sparsity of the LU factorization is maintained on any finite number of scales for self-adjoint strictly elliptic operators and their inverses. Moreover, the condition number of matrices for which we compute the usual LU factorization at different scales is O(1) . The direct multiresolution solver presents, therefore, an alternative to a multigrid approach and may be interpreted as a multigrid method with a single V-cycle.
منابع مشابه
THE USE OF SEMI INHERITED LU FACTORIZATION OF MATRICES IN INTERPOLATION OF DATA
The polynomial interpolation in one dimensional space R is an important method to approximate the functions. The Lagrange and Newton methods are two well known types of interpolations. In this work, we describe the semi inherited interpolation for approximating the values of a function. In this case, the interpolation matrix has the semi inherited LU factorization.
متن کاملParallel Triangular Solvers on GPU
In this paper, we investigate GPU based parallel triangular solvers systematically. The parallel triangular solvers are fundamental to incomplete LU factorization family preconditioners and algebraic multigrid solvers. We develop a new matrix format suitable for GPU devices. Parallel lower triangular solvers and upper triangular solvers are developed for this new data structure. With these solv...
متن کاملComparison of Direct and Iterative Sparse Linear Solvers for Power System Applications on Parallel Computing Platforms
This paper presents a performance comparison of sparse linear solvers based on iterative and direct methods for power system applications implemented on parallel computing platform. The iterative sparse linear solver evaluated in this paper is based on the conjugate gradient algorithm with a Jacobi pre-conditioner executed on a general purpose graphic processing unit (GPGPU). The direct solvers...
متن کاملOn the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملAn hybrid direct-iterative solver based on a hierarchical interface decomposition
Parallel sparse direct solvers are now able to solve efficiently real-life three-dimensional problems having in the order of several millions of equations. They are, however, constrained by prohibitive memory requirements. Iterative methods on the other hand require much less memory, but they often fail to solve ill-conditioned systems. We propose an hybrid direct-iterative method which aims at...
متن کامل